Polyhedral separation via difference of convex (DC) programming
نویسندگان
چکیده
Abstract We consider polyhedral separation of sets as a possible tool in supervised classification. In particular, we focus on the optimization model introduced by Astorino and Gaudioso (J Optim Theory Appl 112(2):265–293, 2002) adopt its reformulation difference convex (DC) form. tackle problem adapting algorithm for DC programming known DCA. present results implementation DCA number benchmark classification datasets.
منابع مشابه
Numerical Computation for Demyanov Difference of Polyhedral Convex Sets
Under the assumption of polyhedron, the Demyanov difference of convex compact sets is computed via some linear programmings by C procedure. The difference from the existing results is also compared, and some examples with the corresponding numerical results are given.
متن کاملSeparation of convex polyhedral sets with column parameters
Separation is a famous principle and separation properties are important for optimization theory and various applications. In practice, input data are rarely known exactly and it is advisable to deal with parameters. In this article, we are concerned with the basic characteristics (existence, description, stability etc.) of separating hyperplanes of two convex polyhedral sets depending on param...
متن کاملMultiobjective DC Programming with Infinite Convex Constraints
In this paper new results are established in multiobjective DC programming with infinite convex constraints (MOPIC for abbr.) that are defined on Banach space (finite or infinite) with objectives given as the difference of convex functions subject to infinite convex constraints. This problem can also be called multiobjective DC semi-infinite and infinite programming, where decision variables ru...
متن کاملPhylogenetic Analysis via Dc Programming
The evolutionary history of species may be described by a phylogenetic tree whose topology captures ancestral relationships among the species, and whose branch lengths denote evolution times. For a fixed topology and an assumed probabilistic model of nucleotide substitution, we show that the likelihood of a given tree is a d.c. (difference of convex) function of the branch lengths, hence maximu...
متن کاملA Dc (difference of Convex Functions) Approach of the Mpecs
This article deals with a study of the MPEC problem based on a reformulation to a DC problem (Difference of Convex functions). This reformulation is obtained by a partial penalization of the constraints. In this article we prove that a classical optimality condition for a DC program, if a constraint qualification is satisfied for MPEC, it is a necessary and sufficient condition for a feasible p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2021
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-021-05758-6